A table of short-period Tausworthe generators for Markov chain quasi-Monte Carlo

نویسندگان

چکیده

We consider the problem of estimating expectations by using Markov chain Monte Carlo methods and improving accuracy replacing IID uniform random points with quasi-Monte (QMC) points. Recently, it has been shown that QMC remains consistent when driving sequences are completely uniformly distributed (CUD). However, definition CUD is not constructive, so an implementation method short-period Tausworthe generators (i.e., linear feedback shift register over two-element field) approximate proposed. In this paper, we conduct exhaustive search for in terms $t$-value, which a criterion uniformity widely used study methods. provide parameter table show effectiveness numerical examples Gibbs sampling.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quasi-Newton Methods for Markov Chain Monte Carlo

The performance of Markov chain Monte Carlo methods is often sensitive to the scaling and correlations between the random variables of interest. An important source of information about the local correlation and scale is given by the Hessian matrix of the target distribution, but this is often either computationally expensive or infeasible. In this paper we propose MCMC samplers that make use o...

متن کامل

New inputs and methods for Markov chain quasi-Monte Carlo

We present some new results on incorporating quasi-Monte Carlo rules into Markov chain Monte Carlo. First, we present some new constructions of points, fully equidistributed LFSRs, which are small enough that the entire point set can be used in a Monte Carlo calculation. Second, we introduce some antithetic and round trip sampling constructions and show that they preserve the completely uniform...

متن کامل

Discrepancy estimates for variance bounding Markov chain quasi-Monte Carlo

Markov chain Monte Carlo (MCMC) simulations are modeled as driven by true random numbers. We consider variance bounding Markov chains driven by a deterministic sequence of numbers. The star-discrepancy provides a measure of efficiency of such Markov chain quasi-Monte Carlo methods. We define a pull-back discrepancy of the driver sequence and state a close relation to the star-discrepancy of the...

متن کامل

Markov Chain Monte Carlo

Markov chain Monte Carlo is an umbrella term for algorithms that use Markov chains to sample from a given probability distribution. This paper is a brief examination of Markov chain Monte Carlo and its usage. We begin by discussing Markov chains and the ergodicity, convergence, and reversibility thereof before proceeding to a short overview of Markov chain Monte Carlo and the use of mixing time...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2021

ISSN: ['0377-0427', '1879-1778', '0771-050X']

DOI: https://doi.org/10.1016/j.cam.2020.113136